The Stabilizing Token Ring In Three Bits - Article Summary
نویسنده
چکیده
This is a summary of the paper ”The Stabilizing Token Ring in Three Bits” / Mohamed G.Gouda and F. Furman Haddix. The paper describes a determinstic algorithm for a selfstabilizing unidirectional token ring in which each process has a fixed number of states which is not depenent on the number of processes. In particular, the state of each one of the processes is represented by three bits. The algorithm is very simple and quite elegant.
منابع مشابه
The Stabilizing Token Ring in Three Bits
that there is no stabilizing token ring whose processes are all identical and where the number of processes in the ring is a composite number. The problem can be solved, however, in some special cases. In particular, Burns and Pachl have shown in [BP89] that problem (i) can be solved if the number of processes is a prime number. Their solution still suffers from problems (ii) and (iii). Problem...
متن کاملColor Optimal Self-Stabilizing Depth-First Token Circulation
The notion of self-stabilization was rst introduced by Dijkstra : it is the property for a system to eventually recover itself a legitimate state after any perturbation modifying the memory state. This paper proposes a self-stabilizing depth-rst token circulation protocol for uniform rooted networks. Such an algorithm is very convenient to obtain the mutual exclusion or to construct a spanning ...
متن کاملConvergence Refinement
Refinement tools such as compilers do not necessarily preserve fault-tolerance. That is, given a fault-tolerant program in a high-level language as input, the output of a compiler in a lower-level language will not necessarily be faulttolerant. In this paper, we identify a type of refinement, namely “convergence refinement”, that preserves the faulttolerance property of stabilization. We illust...
متن کاملThe Self-Stabilizing Edge-Token and Its Applications
Consider a connected graph with nodes (or processes) and edges (or communication links). An edge token associated with an edge is a token maintained by the two nodes connected by the edge; one and only one of the two nodes holds the token. An edge token can be passed from one node to the other if so desired. This paper first presents a randomized self-stabilizing algorithm to implement the edge...
متن کاملOptimality and Self-Stabilization Over Acyclic Distributed Systems
Self-stabilization was rst introduced by Dijkstra Dij74]: it is the property for a system to eventually recover itself a legitimate state after any perturbation modifying the memory state. In its pioneering paper, Dijkstra proposed three algorithms for token ring systems. Such systems are very useful to solve distributed mutual exclusion. Using the token deenition introduced by Dijkstra, i.e. t...
متن کامل